Managing server processes with proxy files

ABSTRACT

Computer-implemented methods and systems are provided for detecting a failed server. The computer-implemented method includes detecting a plurality of servers within a network, allowing each of the plurality of servers to monitor a state of other servers of the plurality of servers, and in response to detecting a failed server, allowing another server of the plurality of servers to complete remaining work of the failed server.

BACKGROUND Technical Field

The present invention relates generally to computing systems, and morespecifically, to systems and methods for managing server processes withproxy files.

Description of the Related Art

The client/server model of distributed computing operates to fulfilluser needs by splitting functions between “client” tasks and “server”tasks performed by computer hardware and software resources that areorganized into a “network” for communication with each other. Using thismodel, a “client” program sends message requests to a “server” programto obtain data and/or processing action according to a communication“protocol” and the server completes the processing transaction bycarrying out the request or deferring it to another time or byindicating that it cannot be fulfilled. This model allows clients andservers to be operated independently of each other in a computer networkby using different hardware and operating systems.

A “proxy server” is often used in handling client requests fortransactions to be completed by other network “application servers”which are capable of performing the data processing actions required forthe transaction but are not accessed directly by the client. If aprocessing transaction is not successfully completed upon initialtransmission of a message, the client can send retransmissions of themessage to an application server using an “arrayed cluster” of proxyservers.

SUMMARY

In accordance with one or more embodiments, a computer-implementedmethod for detecting a failed server is provided. Thecomputer-implemented method includes creating a proxy file for eachserver of a plurality of servers in an active state, assigning atimestamp to each proxy file of each server of the plurality of servers,and permitting each server to inspect each timestamp of each proxy fileof each server of the plurality of servers. The computer-implementedmethod further includes determining whether the timestamp assigned toeach proxy file of each server of the plurality of servers exceeds apredetermined threshold, and in response to a timestamp of a proxy fileof a failed server exceeding the predetermined threshold, allowinganother server of the plurality of servers to complete remaining work ofthe failed server.

In accordance with one or more embodiments, a system for detecting afailed server is provided. The system includes a memory and a processorin communication with the memory, wherein the computer system isconfigured to create a proxy file for each server of a plurality ofservers in an active state, assign a timestamp to each proxy file ofeach server of the plurality of servers, permit each server to inspecteach timestamp of each proxy file of each server of the plurality ofservers, determine whether the timestamp assigned to each proxy file ofeach server of the plurality of servers exceeds a predeterminedthreshold, and in response to a timestamp of a proxy file of a failedserver exceeding the predetermined threshold, allow another server ofthe plurality of servers to complete remaining work of the failedserver.

Furthermore, embodiments may take the form of a related computer programproduct, accessible from a computer-usable or computer-readable mediumproviding program code for use, by or in connection with a computer orany instruction execution system. For the purpose of this description, acomputer-usable or computer-readable medium may be any apparatus thatmay contain means for storing, communicating, propagating ortransporting the program for use, by or in a connection with theinstruction execution system, apparatus, or device.

These and other features and advantages will become apparent from thefollowing detailed description of illustrative embodiments thereof,which is to be read in connection with the accompanying drawings.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The disclosure will provide details in the following description ofpreferred embodiments with reference to the following figures wherein:

FIG. 1 is a block/flow diagram of an exemplary computing system fordetecting a failed application server, in accordance with an embodimentof the present invention;

FIG. 2 is a block/flow diagram of an exemplary server failure detectionsystem where each server in an active state creates a respective proxyfile including a timestamp assigned thereto, in accordance with anembodiment of the present invention;

FIG. 3 is a block/flow diagram of an exemplary server failure detectionsystem where proxy files of servers that are shut down cleanly aredeleted, in accordance with an embodiment of the present invention;

FIG. 4 is a block/flow diagram of an exemplary server failure detectionsystem where each active server periodically updates its own timestamp,in accordance with an embodiment of the present invention;

FIG. 5 is a block/flow diagram of an exemplary server failure detectionsystem where each server inspects the timestamps of the proxy filesbelonging to other servers in the group of servers, in accordance withan embodiment of the present invention;

FIG. 6 is a block/flow diagram of an exemplary server failure detectionsystem where the first server completes the remaining work of the thirdserver and then deletes the proxy file of the third server, inaccordance with an embodiment of the present invention;

FIG. 7 is a block/flow diagram of an exemplary server failure detectionsystem where the deactivated server is reactivated as a new server andcreates a new proxy file within the file directory of the group ofservers, in accordance with an embodiment of the present invention;

FIG. 8 is a block/flow diagram of an exemplary server failure detectionsystem where each proxy file of each active server includes a file lock,in accordance with an embodiment of the present invention;

FIG. 9 is a block/flow diagram of an exemplary method for detecting afailed server, in accordance with an embodiment of the presentinvention;

FIG. 10 is a block/flow diagram of an exemplary cloud computingenvironment, in accordance with an embodiment of the present invention;and

FIG. 11 is a schematic diagram of exemplary abstraction model layers, inaccordance with an embodiment of the present invention.

Throughout the drawings, same or similar reference numerals representthe same or similar elements.

DETAILED DESCRIPTION

The present embodiments are directed to systems and methods fordetecting a failed server within a network. Application servers monitorthe state of their peer application servers in case they fail, thusleaving incomplete work. When an application server detects a peerapplication server to have failed, the failed application server istaken over by another application server configured to complete theremaining work or tasks of the failed application server.

In one or more embodiments, systems and methods are presented fordetecting a failed application server based on management of a set offiles in a dedicated file-system directory. The state of an applicationserver is represented by the presence of a file that represents thatapplication server. The file can act as a proxy for its server.

In one or more embodiments, systems and methods are presented forcreating proxy files for each application server of a plurality ofapplication servers. The proxy files of each application server can bestored in a common file system directory. Each application server thatis part of a group of application servers owns a proxy file in the filesystem directory. The proxy file is deleted or removed when theapplication server it represents is shut down or deactivated.

In one or more embodiments, each application server periodically updatesthe timestamp on its proxy file. Additionally each application serverperiodically inspects the timestamps on the proxy files that belong tothe other application servers, i.e., the peers in the group ofapplication servers. If the timestamp of a proxy file is determined tobe too “old” or “out-of-date,” then the application server representedby the proxy file is considered to have failed. At this point, a peerapplication server (within the group of application servers) can takeownership of the proxy file and complete any necessary work or tasks forthe failed application server. Once the work has been completed, theproxy file for the failed application server can be deleted or removed.Moreover, the process of coordinating access to proxy files can bemanaged through exclusive file locks to prevent more than one peerapplication server from attempting to complete work belonging to afailed application server. Thus, each proxy file created or generatedcan be associated with or assigned to a file lock.

In one or more embodiments, systems and methods for detecting a failureof an application server are presented and fault tolerance among peerservers is enabled by permitting each server to periodically update itsown proxy file and check the timestamp of other application serverswithin a group of application servers. Additionally, if a failure isdetected in the absence of a recent timestamp in the file, a takeovercan be enabled by a peer application server.

Referring now to the drawings in which like numerals represent the sameor similar elements and initially to FIG. 1, a block/flow diagram of anexemplary computing system for detecting a failed application server ispresented, in accordance with an embodiment of the present invention.

An exemplary server processing system 100 for detecting a failedapplication server to which the present invention may be applied isshown in accordance with one embodiment. The server processing system100 includes at least one processor (CPU) 104 operatively coupled toother components via a system bus 102. A cache 106, a Read Only Memory(ROM) 108, a Random Access Memory (RAM) 110, an input/output (I/O)adapter 130, a user interface adapter 150, and a display adapter 160,are operatively coupled to the system bus 102.

A first storage device 122 and a second storage device 124 areoperatively coupled to system bus 102 by the I/O adapter 120. Thestorage devices 122 and 124 can be any of a disk storage device (e.g., amagnetic or optical disk storage device), a solid state magnetic device,and so forth. The storage devices 122 and 124 can be the same type ofstorage device or different types of storage devices. The I/O adapter120 further communicates with application servers 170 and a file systemdirectory 172.

The application servers 170 and the file system directory 172 may beassociated with the storage device 122. Such servers/directories 170,172 need not be incorporated within the storage device 122. Suchservers/directories 170, 172 may be external to the storage device 122.One skilled in the art may contemplate different system and networkingconfigurations for incorporating the servers/directories 170, 172therein.

A speaker 132 is operatively coupled to system bus 102 by the soundadapter 130. A display device 162 is operatively coupled to system bus102 by display adapter 160.

A first user input device 152, a second user input device 154, and athird user input device 156 are operatively coupled to system bus 102 byuser interface adapter 150. The user input devices 152, 154, and 156 canbe any of a keyboard, a mouse, a keypad, an image capture device, amotion sensing device, a microphone, a device incorporating thefunctionality of at least two of the preceding devices, and so forth. Ofcourse, other types of input devices can also be used, while maintainingthe spirit of the present invention. The user input devices 152, 154,and 156 can be the same type of user input device or different types ofuser input devices. The user input devices 152, 154, and 156 are used toinput and output information to and from the processing system 100.

Of course, the server processing system 100 may also include otherelements (not shown), as readily contemplated by one of skill in theart, as well as omit certain elements. For example, various other inputdevices and/or output devices can be included in the server processingsystem 100, depending upon the particular implementation of the same, asreadily understood by one of ordinary skill in the art. For example,various types of wireless and/or wired input and/or output devices canbe used. Moreover, additional processors, controllers, memories, and soforth, in various configurations can also be utilized as readilyappreciated by one of ordinary skill in the art. These and othervariations of the server processing system 100 are readily contemplatedby one of ordinary skill in the art given the teachings of the presentinvention provided herein.

FIG. 2 is a block/flow diagram of an exemplary server failure detectionsystem where each server in an active state creates a respective proxyfile including a timestamp assigned thereto, in accordance with anembodiment of the present invention.

The system 200 includes a group of servers 220. The group of servers 220can include, e.g., three application servers 222, 224, 226. The group ofservers 220 can communicate with a file system directory 240. Oneskilled in the art may contemplate a number of different applicationservers within the server group.

When application servers 222, 224, 226 within the group of servers 220are activated, a proxy file is created for each application server 222,224, 226. In the instant case, all three application servers 222, 224,226 are in an active state at first point in time (t=1). The proxy fileof each application server is stored in the file system directory 240.For example, the first application server 222 has a first proxy file 242with a first timestamp 241. The second application server 224 has asecond proxy file 244 with a second timestamp 243. The third applicationserver 226 has a third proxy file 246 with a third timestamp 245.Therefore, each active application server creates its own proxy filewith a timestamp included therein.

FIG. 3 is a block/flow diagram of an exemplary server failure detectionsystem where proxy files of servers that are shut down cleanly aredeleted, in accordance with an embodiment of the present invention.

The system 200 includes a group of servers 220. The group of servers 220can include, e.g., three application servers 222, 224, 226. The group ofservers 220 can communicate with a file system directory 240. Whenapplication servers 222, 224, 226 within the group of servers 220 areactivated, a proxy file is created for each application server 222, 224,226. In the instant case, the first application server 222 is in anactive state, whereas the second and third application servers 224, 226have been shut down (clean shut down). As such, the proxy files of thesecond and third application servers 224, 226 are deleted in the filesystem directory 240. Therefore, each application server deletes itsproxy file from the file system directory upon clean shutdown.

FIG. 4 is a block/flow diagram of an exemplary server failure detectionsystem where each active server periodically updates its own timestamp,in accordance with an embodiment of the present invention.

The system 200 includes a group of servers 220. The group of servers 220can include, e.g., three application servers 222, 224, 226. The group ofservers 220 can communicate with a file system directory 240. Whenapplication servers 222, 224, 226 within the group of servers 220 areactivated, a proxy file is created for each application server 222, 224,226. In the instant case, all three servers 222, 224, 226 are active andthus a proxy file 242, 244, 246 is associated with each server 222, 224,226, respectively, where each proxy file 242, 244, 246 is associatedwith a respective or corresponding timestamp. FIG. 4 illustrates thateach application server 222, 224, 226 has the capability to update itsown timestamp at predetermined or predefined or pre-established timeperiods or intervals. For example, at time (t=2), the first applicationserver 222 updated its timestamp (251) in proxy file 242, the secondapplication server 224 updated its timestamp (253) in proxy file 244,and third application server 226 updated its timestamp (255) in proxyfile 246. Therefore, each server can regularly update its timestampswhile it is alive or active.

FIG. 5 is a block/flow diagram of an exemplary server failure detectionsystem where each server inspects the timestamps of the proxy filesbelonging to other servers in the group of servers, in accordance withan embodiment of the present invention.

Referring back to FIG. 2, the first application server 222 can inspectits own timestamp 241 of proxy file 242 to determine if the timestamp241 is up-to-date or current. Additionally, the first application server222 can inspect the timestamps 243, 245 of the second and third proxyfiles 244, 246, respectively to determine if the timestamps 243, 245 areup-to-date or current. Similarly, the second application server 224 caninspect the timestamps 241, 245 of the first and third proxy files 242,246, respectively to determine if the timestamps 241, 245 are up-to-dateor current. Similarly, the third application server 226 can inspect thetimestamps 241, 243 of the first and second proxy files 242, 244,respectively to determine if the timestamps 241, 243 are up-to-date orcurrent. Therefore, the application servers 222, 224, 226 of the groupof servers 220 can check or inspect each other's timestamps, in additionto checking and updating their own timestamps.

In FIG. 5, one of the application servers 222, 224, 226 detected thatthe timestamp 245 (FIG. 2) is “old,” thus making the proxy file 246associated with the third application server 226 “old” or “out-of-date.”The timestamp 245 (FIG. 2) can now be designated as old timestamp 265(FIG. 5) and the proxy file 246 can be designated as an old file. As aresult, the third application server 226 is designated as a failedapplication server. When the third application server 226 is a failedapplication server, one of application servers 222, 224 can takeownership of the third application server 226 of the group of servers220. In other words, one of application servers 222, 224 can attempt tocomplete the remaining work that was not finished by the thirdapplication server 226. Thus, all tasks assigned to the thirdapplication server 226 that have not been completed are reassignedeither to or taken over by the first or second application servers 222,224. The application servers 222, 224 that take over the remaining workcan also establish a communication path 260 with the file systemdirectory 240 to access the old proxy file of the third applicationserver 226.

FIG. 6 is a block/flow diagram of an exemplary server failure detectionsystem where the first server completes the remaining work of the thirdserver and then deletes the proxy file of the third server, inaccordance with an embodiment of the present invention.

Once one of the application servers 222, 224 has completed all theremaining work or tasks not completed by the third application server226, the old proxy file is deleted or removed from the file systemdirectory 240. In one example, the one of the application servers 222,224 can then send a notification to the third application server 226,which is still in a state of failure that all the remaining work ortasks have been completed. The third application server 226 is thendeactivated (inactive state).

FIG. 7 is a block/flow diagram of an exemplary server failure detectionsystem where the deactivated server is reactivated as a new server andcreates a new proxy file within the file directory of the group ofservers, in accordance with an embodiment of the present invention.

The failed application server 226 may never restart. However, if thefailed application server 226 does restart or is reactivated, it startsor reactivates as a new server at a point in time (t=3). Therefore, whenan application server fails as a result of an “old” or “out-of-date”timestamp associated with its proxy file, the application server can bedeactivated, and an application server within the group of applicationservers can take its place by taking over ownership. Taking overownership entails completing any and all remaining tasks or work notcompleted by the third application server. When all the remaining tasksor work have been completed by the takeover server, the old proxy fileis deleted, the third application server can be reactivated as a newapplication server 226′ of the group of servers 220, and a new proxyfile 276 with a new timestamp 275 can be created in the file directoryassociated with the new application server 226′.

FIG. 8 is a block/flow diagram of an exemplary server failure detectionsystem where each proxy file of each active server includes a file lock,in accordance with an embodiment of the present invention.

Each of the proxy files associated with each application server caninclude a file lock. For example, the first proxy file 242 includes afile lock 282, the second proxy file 244 includes a file lock 284, andthe third proxy file 246 includes a file lock 286. The file locks 282,284, 286 prevent more than one application server 222, 224, 226 fromaccessing a single failed application server. For instance, if the firstapplication server 222 fails, then one of the peer servers 224, 226needs to jump in and take over ownership of the remaining work or tasksto be completed by the first application server 222. If the second 224application server takes over the first application server 222, then thefile lock 282 associated with the first proxy file 242 of the firstapplication server 222 prevents the third application server 226 fromtaking over ownership the remaining work or tasks of the firstapplication server 222. Therefore, it is assured that only oneapplication or peer server takes over the remaining tasks or work ofonly one failed application server. Therefore, one peer applicationserver per one failed application server is desired.

FIG. 9 is a block/flow diagram of an exemplary method for detecting afailed server, in accordance with an embodiment of the presentinvention.

At block 910, a proxy file is created for each server of a plurality ofservers in an active state.

At block 920, a timestamp is assigned to each proxy file of each serverof the plurality of servers.

At block 930, each server is permitted to inspect each timestamp of eachproxy file of each server of the plurality of servers.

At block 940, it is determined whether the timestamp assigned to eachproxy file of each server of the plurality of servers exceeds apredetermined threshold.

At block 950, in response to a timestamp of a proxy file of a failedserver exceeding the predetermined threshold, another server of theplurality of servers is allowed to complete the remaining work or tasksof the failed application server.

In one or more embodiments, the application or peer servers within thegroup of servers can be ranked or weighed or classified based ondifferent factors or parameters or variables. For instance, arelationship can be established between the remaining work of the failedapplication server and, e.g., the processing capabilities of theavailable application servers. If the failed application server hasseveral heavy or intense or time-consuming tasks to complete, then anapplication server having the processing capability to process heavy orintense or time-consuming tasks can be assigned to the failedapplication server. Therefore, e.g., the processing power of theapplication server can be taken into account when takeover of a failedapplication server is triggered. Thus, each of the application serverswithin a group of servers can be ranked based on, e.g., processing poweror processing capabilities. Each application server within a group ofapplication servers can be ranked based on other factors, such asprevious uses, specialized functionality, number of processors,processor speed, location of peer server, etc. As a result, assignmentsto failed application servers can be influenced or affected ordetermined by analyzing operations or functions or capabilities ofavailable application servers within the group of servers.

In one or more embodiments, the time it takes to complete the remainingtasks or work of each application server can be taken into account whenassigning an application server to the failed application server. Forinstance, if a first application server has, e.g., 3 remaining tasks andit is calculated that it would take, e.g., 5-10 minutes to complete suchtasks, then a simple application server with relatively low processingcapabilities can be assigned to take over ownership of such failedapplication server. In contrast, if a second application server has,e.g., 150 remaining tasks and it is calculated that it would take, e.g.,3-4 hours to complete such tasks, then a hard-core application serverwith relatively high processing capabilities can be assigned to takeover ownership of such failed application server. Therefore, the time itwould take remaining tasks or work to be completed can be factored intoapplication server assignments. Application servers with very highprocessing power can be saved for “special” processing tasks or workthat needs to be completed.

In one or more embodiments, an application server within a group ofapplication servers can monitor or track each timestamp of eachapplication server within that group of application servers. However, itis also contemplated that an application server within a group ofapplication servers monitors a subset of the other application servers.For instance, if the server group includes 100 application servers, thenthe group of servers can be subdivided or split into several sub-groupsor subsets (e.g., 4 subsets). Each subset can be monitored by oneapplication server, and each subset can monitor itself. One skilled inthe art may contemplate different self-regulating or self-inspectingstrategies depending on the number of application servers within thegroup of servers.

FIG. 10 is a block/flow diagram of an exemplary cloud computingenvironment, in accordance with an embodiment of the present invention.

It is to be understood that although this disclosure includes a detaileddescription on cloud computing, implementation of the teachings recitedherein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g., networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported, providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based e-mail).The consumer does not manage or control the underlying cloudinfrastructure including network, servers, operating systems, storage,or even individual application capabilities, with the possible exceptionof limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forload-balancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure that includes anetwork of interconnected nodes.

Referring now to FIG. 10, illustrative cloud computing environment 1050is depicted for managing server processes with proxy files. As shown,cloud computing environment 1050 includes one or more cloud computingnodes 1010 with which local computing devices used by cloud consumers,such as, for example, personal digital assistant (PDA) or cellulartelephone 1054A, desktop computer 1054B, laptop computer 1054C, and/orautomobile computer system 1054N may communicate. Nodes 1010 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described hereinabove, or a combinationthereof. The network may also be a network for managing server processeswith proxy files. The This allows cloud computing environment 1050 tooffer infrastructure, platforms and/or software as services for which acloud consumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 1054A-Nshown in FIG. 10 are intended to be illustrative only and that computingnodes 1010 and cloud computing environment 1050 can communicate with anytype of computerized device over any type of network and/or networkaddressable connection (e.g., using a web browser).

FIG. 11 is a schematic diagram of exemplary abstraction model layers, inaccordance with an embodiment of the present invention. It should beunderstood in advance that the components, layers, and functions shownin FIG. 11 are intended to be illustrative only and embodiments of theinvention are not limited thereto. As depicted, the following layers andcorresponding functions are provided:

Hardware and software layer 1160 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 1161;RISC (Reduced Instruction Set Computer) architecture based servers 1162;servers 1163; blade servers 1164; storage devices 1165; and networks andnetworking components 1166. In some embodiments, software componentsinclude network application server software 1167 and database software1168.

Virtualization layer 1170 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers1171; virtual storage 1172; virtual networks 1173, including virtualprivate networks; virtual applications and operating systems 1174; andvirtual clients 1175.

In one example, management layer 1180 may provide the functionsdescribed below. Resource provisioning 1181 provides dynamic procurementof computing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 1182provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may include applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 1183 provides access to the cloud computing environment forconsumers and system administrators. Service level management 1184provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 1185 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 1190 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 1191; software development and lifecycle management 1192;virtual classroom education delivery 1193; data analytics processing1194; transaction processing 1195; and managing server processes withproxy files 1196.

Still yet, any of the components of the present invention could becreated, integrated, hosted, maintained, deployed, managed, serviced,etc. by a service supplier who offers to provide a method for detectinga failed server. Thus, the present invention discloses a process fordeploying, creating, integrating, hosting, maintaining, and/orintegrating computing infrastructure, including integratingcomputer-readable code into the server processing system 100 (FIG. 1),wherein the code in combination with the server processing system 100 iscapable of detecting a failed server. In another embodiment, theinvention provides a business method that performs the processblocks/steps of the invention on a subscription, advertising, and/or feebasis. That is, a service supplier, such as a Solution Integrator, couldoffer to provide a method for detecting a failed server. In this case,the service supplier can create, maintain, support, etc. a computerinfrastructure that performs the process blocks/steps of the inventionfor one or more customers. In return, the service supplier can receivepayment from the customer(s) under a subscription and/or fee agreementand/or the service supplier can receive payment from the sale ofadvertising content to one or more third parties.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinaryskills in the art without departing from the scope and spirit of thedescribed embodiments. The terminology used herein was chosen to bestexplain the principles of the embodiments, the practical application ortechnical improvement over technologies found in the marketplace, or toenable others of ordinary skills in the art to understand theembodiments disclosed herein.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational blocks/steps to be performed on thecomputer, other programmable apparatus or other device to produce acomputer implemented process, such that the instructions which executeon the computer, other programmable apparatus, or other device implementthe functions/acts specified in the flowchart and/or block diagram blockor blocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the blocks may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

Reference in the specification to “one embodiment” or “an embodiment” ofthe present principles, as well as other variations thereof, means thata particular feature, structure, characteristic, and so forth describedin connection with the embodiment is included in at least one embodimentof the present principles. Thus, the appearances of the phrase “in oneembodiment” or “in an embodiment”, as well any other variations,appearing in various places throughout the specification are notnecessarily all referring to the same embodiment.

It is to be appreciated that the use of any of the following “/”,“and/or”, and “at least one of”, for example, in the cases of “A/B”, “Aand/or B” and “at least one of A and B”, is intended to encompass theselection of the first listed option (A) only, or the selection of thesecond listed option (B) only, or the selection of both options (A andB). As a further example, in the cases of “A, B, and/or C” and “at leastone of A, B, and C”, such phrasing is intended to encompass theselection of the first listed option (A) only, or the selection of thesecond listed option (B) only, or the selection of the third listedoption (C) only, or the selection of the first and the second listedoptions (A and B) only, or the selection of the first and third listedoptions (A and C) only, or the selection of the second and third listedoptions (B and C) only, or the selection of all three options (A and Band C). This may be extended, as readily apparent by one of ordinaryskill in this and related arts, for as many items listed.

Having described preferred embodiments of a system and method (which areintended to be illustrative and not limiting), it is noted thatmodifications and variations can be made by persons skilled in the artin light of the above teachings. It is therefore to be understood thatchanges may be made in the particular embodiments disclosed which arewithin the scope of the invention as outlined by the appended claims.Having thus described aspects of the invention, with the details andparticularity required by the patent laws, what is claimed and desiredprotected by Letters Patent is set forth in the appended claims.

The invention claimed is:
 1. A computer-implemented method executed on aprocessor for detecting a failed server, the method comprising:detecting a plurality of servers within a network; allowing each of theplurality of servers to monitor a state of other servers of theplurality of servers; and in response to detecting a failed server basedon management of a set of proxy files in a dedicated file directorywhere each proxy file has a single file lock for managing serverownership takeover, allowing another server of the plurality of serversto complete remaining work of the failed server, where each servercreates a proxy file to represent that server.
 2. The method of claim 1,wherein each proxy file represents a server of a plurality of servers inan active state.
 3. The method of claim 2, further comprising assigninga timestamp to each proxy file of each server of the plurality ofservers.
 4. The method of claim 3, further comprising permitting eachserver to inspect each timestamp of each proxy file of each server ofthe plurality of servers.
 5. The method of claim 4, further comprisingdetermining whether the timestamp assigned to each proxy file of eachserver of the plurality of servers exceeds a predetermined threshold. 6.The method of claim 5, further comprising, in response to a timestamp ofa proxy file of the failed server exceeding the predetermined threshold,allowing the another server to complete the remaining work of the failedserver.
 7. The method of claim 2, further comprising storing each proxyfile of each server of the plurality of servers in the dedicated filedirectory.
 8. The method of claim 7, further comprising periodicallyupdating a timestamp of each proxy file of each server of the pluralityof servers.
 9. The method of claim 1, wherein, when the remaining workis completed b the another server, the failed server is not reactivated.10. A computer system for detecting a failed server, the computer systemcomprising: a memory; and a processor in communication with the memory,wherein the processor is configured to: detect a plurality of serverswithin a network; allow each of the plurality of servers to monitor astate of other servers of the plurality of servers; and in response todetecting a failed server based on management of a set of proxy files ina dedicated file directory where each proxy file has a single file lockfor managing server ownership takeover, allow another server of theplurality of servers to complete remaining work of the failed server,where each server creates a proxy file to represent that server.
 11. Thesystem of claim 10, wherein a timestamp is assigned to each proxy fileof each server of the plurality of servers.
 12. The system of claim 11,wherein each server is permitted to inspect each timestamp of each proxyfile of each server of the plurality of servers.
 13. The system of claim12, wherein it is determined whether the timestamp assigned to eachproxy file of each server of the plurality of servers exceeds apredetermined threshold.
 14. The system of claim 13, wherein, inresponse to a timestamp of a proxy file of the failed server exceedingthe predetermined threshold, the another server is allowed to completethe remaining work of the failed server.
 15. The system of claim 10,wherein each proxy the of each server of the plurality of servers isstored in the dedicated the directory.
 16. The system of claim 15,wherein a timestamp of each proxy file of each server of the pluralityof servers is periodically updated.
 17. A computer readable storagemedium comprising a computer readable program for detecting a failedserver, wherein the computer readable program when executed on acomputer causes the computer to perform the steps of: detecting aplurality of servers within a network; allowing each of the plurality ofservers to monitor a state of other servers of the plurality of servers;and in response to detecting a failed server based on management of aset of proxy files in a dedicated file directory where each proxy filehas a single file lock for managing server ownership takeover, allowinganother server of the plurality of servers to complete remaining work ofthe failed server, where each server creates a proxy file to representthat server.
 18. The computer readable storage medium of claim 17,wherein the method further comprises: assigning a timestamp to eachproxy file of each server of the plurality of servers; and permittingeach server to inspect each timestamp of each proxy file of each serverof the plurality of servers.